Serially Concatenated Polar Codes
نویسندگان
چکیده
منابع مشابه
Serially Concatenated IRA Codes
We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeataccumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagati...
متن کاملSerially Concatenated Convolutional Codes with Product Distance
J. Freudenberger*, R. Jordan*, M. Bossert*, and S. Shavgulidze** * University of Ulm, Dep. of Information Technology Albert-Einstein-Allee 43, D-89081 Ulm, Germany Email: jfreuden,jordan,[email protected] ** Georgian Technical University, Dep. of Digital Communication Theory Kostava str. 77, Tbilisi 380075, Georgia Email: sergo [email protected] Abstract: In this paper we investigate s...
متن کاملOptimal Scheduling for Multiple Serially Concatenated Codes
In this paper an algorithm is proposed that finds the optimal activation schedule for the component decoders for iterative decoding of systems with three or more serially concatenated codes. It is optimal in terms of minimizing the total decoding complexity required to reach the convergence point. It is also demonstrated that the convergence threshold can be found by combining several three-dim...
متن کاملDesign of Serially Concatenated Interleaved Codes
A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, and an inner encoder whose input words are the permuted outer codewords. In this paper we derive design guidelines for the outer and inner codes that maximize the interleaver gain and the asymptotic slope of the error probability curves.
متن کاملDesign of Rate-Compatible Serially Concatenated Convolutional Codes
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer charts analysis. Following this approach, we construct a family o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2877720